package com.yeung.exam;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class 快手_字母组合 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String line = sc.nextLine();
        char[] chars = line.toCharArray();
        int[] numbers = new int[chars.length];
        for (int i = 0; i < chars.length; i++) {
            numbers[i] = Integer.parseInt(chars[i] + "");
        }
        //
        Set<String> set = new HashSet<>();
        ArrayList<char[]> mapping = new ArrayList<>();
        for (int number : numbers) {
            char[] chs = getChars(number);
            mapping.add(chs);
        }

        for (int i = 1; i < mapping.size(); i++) {
        }


    }

    public static char[] getChars(int number) {
        char[] result = null;
        switch (number) {
            case 2:
                result = new char[]{'a', 'b', 'c'};
                break;
            case 3:
                result = new char[]{'d', 'e', 'f'};
                break;
            case 4:
                result = new char[]{'g', 'h', 'i'};
                break;
            case 5:
                result = new char[]{'j', 'k', 'l'};
                break;
            case 6:
                result = new char[]{'m', 'n', 'o'};
                break;
            case 7:
                result = new char[]{'p', 'q', 'r', 's'};
                break;
            case 8:
                result = new char[]{'t', 'u', 'v'};
                break;
            case 9:
                result = new char[]{'w', 'x', 'y', 'z'};
                break;
        }
        return result;
    }


}
